Preference-Based Constrained Optimization with CP-Nets
نویسندگان
چکیده
Many AI tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of con-
منابع مشابه
Generalized solution techniques for preference-based constrained optimization with CP-nets
"% ! !! ! " " :( % ! ! (! ! ! ! ! ! ; %! ! ! % ( :( " ! " ! ! ! ! " ( ! " <% ! ! !% %" ! " " : ! / ! " " ! : ! " % %" ! " " : ! !%:!% ! ! = = = ; % et al. " ! ( ! > " ( ? : : ! ! ( !" ! %" ! " " : ! ? ! % ! "! : ! %! ! ! ! % (: ! ! ! !! ! %! ? : ( ! % <% ( "%
متن کاملIntroducing Variable Importance Tradeoffs into CP-Nets
The ability to make decisions and to assess po tential courses of action is a comer-stone of many AI applications, and usually this requires explicit information about the decision-maker's prefer ences. In many applications, preference elic itation is a serious bottleneck. The user ei ther does not have the time, the knowledge, or the expert support required to specify complex multi-attribu...
متن کاملConstraint-Based Preferential Optimization
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP-net are the solutions of a set of hard constraints. We then propose a new algorithm for finding the optimal outcomes of a constrained CPnet which makes use of hard constraint solving. Unlike previous algorithms, this new algorithm works even with cyclic CP-nets. In addition, the algorithm is not...
متن کاملOn Graphical Modeling of Preference and Importance
In recent years, CP-nets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CP-nets capture and support reasoning with qualitative conditional preference statements, statements that are relatively natural for users to express. In this paper, we extend the CP-nets formalism to handle another class of very natural qualitative statements one often u...
متن کاملExtending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets can be expressed in this language, and the semantics and proof theory generalise those of CP-nets. Despite being substantially more expressive, the formalism maintains important properties of CP-nets...
متن کاملTCP-nets - Introducing Variable Importance Tradeoffs into CP-nets
The ability to make decisions and to assess potential courses of action is a corner-stone of many AI applications. Typically, this ability requires explicit information about the decision-maker’s preferences. In many applications, preference elicitation is a serious bottleneck. The user either does not have the time, the knowledge, or the expert support required to specify complex multi-attribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Intelligence
دوره 20 شماره
صفحات -
تاریخ انتشار 2004